Hypercomputation: philosophical issues

نویسنده

  • B. Jack Copeland
چکیده

A survey of the /eld of hypercomputation, including discussion of four a priori objections to the possibility of hypercomputation. An exegesis of Turing’s preand post-war writings on the mind is given, and Turing’s views on the scope of machines are discussed. c © 2003 Published by Elsevier B.V.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Hypercomputation, Frege, Deleuze: Solving Thomson's Lamp

We present the first known solution to the original supertask, the Thomson Lamp Paradox. Supertasks, or infinite operations, form an integral part of the emerging study of hypercomputation (computation in excess of classical Turing machine capabilities) and are of philosophical interest for the paradoxes they engender. We also offer preliminary resources for classifying computational complexity...

متن کامل

On Bifurcated Supertasks and Related Questions

Abstract. Bifurcated supertasks entail the actual infinite division of time (accelerated system of reference) as well as the existence of half-curves of infinite length (supertask system of reference). This paper analyzes both issues from a critique perspective. It also analyzes a conflictive case of hypercomputation performed by means of a bifurcated supertask. The results of these analyzes su...

متن کامل

Non-Classical Hypercomputation

Hypercomputation that seeks to solve the Halting Problem, or to compute Turing-uncomputable numbers, might be called “classical” hypercomputation, as it moves beyond the classical Turing computational paradigm. There are further computational paradigms that we might seek to move beyond, forming the basis for a wider “non-classical” hypercomputation. This paper surveys those paradigms, and poses...

متن کامل

The case for hypercomputation

The weight of evidence supporting the case for hypercomputation is compelling. We examine some 20 physical and mathematical models of computation that are either known or suspected to have super-Turing or hypercomputational capabilities, and argue that there is nothing in principle to prevent the physical implementation of hypercomputational systems. Hypercomputation may indeed be intrinsic to ...

متن کامل

Computational Power of Infinite Quantum Parallelism

Recent works have independently suggested that quantum mechanics might permit procedures that fundamentally transcend the power of Turing Machines as well as of ‘standard’ Quantum Computers. These approaches rely on and indicate that quantum mechanics seems to support some infinite variant of classical parallel computing. We compare this new one with other attempts towards hypercomputation by s...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Theor. Comput. Sci.

دوره 317  شماره 

صفحات  -

تاریخ انتشار 2004